import java.util.Scanner;
public class Main {
    //先用辗转相除法求最大公约数
    public static int gcd(int m,int n){
        if(m == n) {
            return m;
        }
        if(m < n) {
            int tmp = m;
            m = n;
            n = tmp;
        }
        int r;
        while((r = m % n) != 0) {
            m = n;
            n = r;
        }
        return n;
    }
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int A = in.nextInt();
        int B = in.nextInt();
        int ret = gcd(A,B);
        //最小公倍数等于两数的积除以最大公约数
        int  g = A*B/ret;
        System.out.println(g);
    }
}